Threshold Key-Recovery Systems for RSA
نویسنده
چکیده
Although threshold key-recovery systems for the discrete log based cryptosys-tems such as the ElGamal scheme have been proposed by Feldman and Pedersen 6, 11, 12], no (practical) threshold key-recovery system for the factoring based cryptosystems such as the RSA scheme has been proposed. 1 This paper proposes the rst (practical) threshold key-recovery systems for the factoring based cryptosystems including the RSA and Rabin schemes. Almost all of the proposed systems are unconditionally secure, since the systems utilize unconditionally secure bit-commitment protocols and unconditionally secure VSS.
منابع مشابه
GBD Threshold Cryptography with an Application to RSA Key Recovery
We present protocols for threshold cryptography in the GBD public-key cryptosystem. Both threshold decryption and threshold key generation are covered, in the “honest-butcurious” setting. This shows that it is possible to perform GBD computations in a distributed manner during both key generation and decryption, without revealing the private key to any party. GBD threshold decryption is similar...
متن کاملGBD Threshold Cryptography with an Application to RSA Key Recovery
We present protocols for threshold decryption and threshold key generation in the GBD public-key cryptosystem in the “honest-butcurious” setting. These allow GBD computations to be performed in a distributed manner during both key generation and decryption, without revealing the private key to any party. GBD threshold decryption is similar to El-Gamal threshold decryption. GBD threshold key gen...
متن کاملA second threshold for the hard-core model on a Bethe lattice
We determine the approximate value of a critical activity for the hard-core model on the Bethe lattice, which determines whether the unique simple invariant Gibbs measure is extremal. This “recovery threshold” turns out to be different both from the threshold for unique Gibbs measure and (in contrast to the Ising model) from the threshold for recovery of root information purely from statistical...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملRSA Threshold Cryptography
In this project, a new threshold signing scheme for RSA has been proposed. The scheme does not require a trusted third party and no secure information is leaked throughout the protocol. The time and storage complexity of the protocol is linear in the number of parties and no restriction is placed on the RSA moduli. Combined with the n-out-of-n key generation protocol of Boneh and Franklin, one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997